Aiming at the disadvantages of traditional Bald Eagle Search optimization algorithm （BES）， such as easy to fall into the local optimum and slow convergence， a BES with Golden Sine Algorithm （Gold-SA） and crisscross strategy （GSCBES） was proposed. Firstly， the position update formula based on inertia weight was set in the traditional BES search stage. Then， Gold-SA was introduced in the stage of predation. Finally， the crisscross strategy was introduced to modify the global optimum and population. The optimization ability of the proposed algorithm was evaluated by the simulation experiments on 11 Benchmark functions， CEC2014 functions and by using Wilcoxon rank sum test. The results show that the proposed algorithm converges faster. At the same time， the weights and thresholds of Back Propagation （BP） neural network were assigned by the proposed algorithm， and the optimized BP neural network model was used in the prediction of air quality， the values of Mean Absolute Error （MAE）， Root Mean Square Error （RMSE）， Mean Square Error （MSE）， and Mean Absolute Percentage Error （MAPE） are smaller than those of BP neural network model and Particle Swarm Optimization （PSO） based BP neural network model，and the prediction accuracy is improved.

Aiming at the problems of the mismatch between aspect words and irrelevant context and the lack of grammatical level features in Aspect-Based Sentiment Analysis （ABSA） at current stage， an improved ABSA model integrating match-Long Short-Term Memory （mLSTM） and grammatical distances was proposed， namely mLSTM-GCN. Firstly， the correlation between the aspect word and the context was calculated word by word， and the obtained attention weight and the context representation were fused as the input of the mLSTM， so that the context representation with higher correlation with the aspect word was obtained. Then， the grammatical distance was introduced to obtain a context which was more grammatically related to the aspect word， so as to obtain more contextual features to guide the modeling of the aspect word， and obtain the aspect representation through the aspect masking layer. Finally， in order to exchange information， location weights， context representations and aspect representations were combined， thereby obtaining the features for sentiment analysis. Experimental results on Twitter， REST14 and LAP14 datasets show that compared with Aspect-Specific Graph Convolutional Network （ASGCN）， mLSTM-GCN has the accuracy improved by 1.32， 2.50 and 1.63 percentage points， respectively， and has the Macro-F1 score improved by 2.52， 2.19 and 1.64 percentage points， respectively. Therefore， mLSTM-GCN can effectively reduce the probability of mismatch between aspect words and irrelevant context， and improve the classification effect.

Test architecture design is the basic and key issue of Integrated Circuit (IC) test, and the design of effective test architecture that meet the needs of IC is of great importance to reduce chip cost, improve product quality and increase product competitiveness. Therefore, a test architecture with several ring scan chains using the same test pin in the round robin manner was proposed, namely RRR Scan. In RRR Scan, the scan flip-flops were designed as multiple ring scan chains, which can work in stealth scan mode, ring shift scan mode and linear scan mode. The ring shift scan mode enables the reuse of test data, thus reducing the size of the test set; the stealth scan mode can shorten the test data shifting path, thus significantly reduing the test shifting power consumption, so that the architecture is a general test architecture with the characteristics of data reuse and low power consumption. In addition, in the architecture, the physically adjacent scan cells can be set into the same ring scan chain with little wiring cost. With stealth scan mode, both the shifting length and the delay of test data can be reduced. Experimental results show that the shifting power consumption can be reduced greatly by RRR Scan, and for S13207 circuit, the shifting power consumption is only 0.42% of that of the linear scan.

Image fusion technology plays an important role in computer-aided diagnosis. Detail extraction and energy preservation are two key issues in image fusion, and the traditional fusion methods address them simultaneously by designing the fusion method. However, it tends to cause information loss or insufficient energy preservation. In view of this, a fusion method was proposed to solve the problems of detail extraction and energy preservation separately. The first part of the method aimed at detail extraction. Firstly, the Non-Subsampled Shearlet Transform (NSST) was used to divide the source image into low-frequency and high-frequency subbands. Then, an improved energy-based fusion rule was used to fuse the low-frequency subbands, and an strategy based on the intuitionistic fuzzy set theory was proposed for the fusion of the high-frequency subbands. Finally, the inverse NSST was employed to reconstruct the image. In the second part, an intensity enhancement method was proposed for energy preservation. The proposed method was verified on 43 groups of images and compared with other eight fusion methods such as Principal Component Analysis (PCA) and Local Laplacian Filtering (LLF). The fusion results on two different categories of medical image fusion (Magnetic Resonance Imaging (MRI) and Positron Emission computed Tomography (PET), MRI and Single-Photon Emission Computed Tomography (SPECT)) show that the proposed method can obtain more competitive performance on both visual quality and objective evaluation indicators including Mutual Information (MI), Spatial Frequency (SF), Q value, Average Gradient (AG), Entropy of Information (EI), and Standard Deviation (SD), and can improve the quality of medical image fusion.

For Mixed-Variable Optimization Problem (MVOP) containing both continuous and categorical variables, a coevolution strategy was proposed to search the mixed-variable decision space, and a Coevolutionary Ant Colony Optimization Algorithm for MVOP (CACOA _MV) was developed. In CACOA _MV, the continuous and categorical sub-populations were generated by using the continuous and discrete Ant Colony Optimization (ACO) strategies respectively, the sub-vectors of continuous and categorical variables were evaluated with the help of cooperators, and the continuous and categorical sub-populations were respectively updated to realize the efficient coevolutionary search in the mixed-variable decision space. Furthermore, the ability of global exploration to the categorical variable solution space was improved by introducing a smoothing mechanism of pheromone, and a "best+random cooperators" restart strategy facing the coevolution framework was proposed to enhance the efficiency of coevolutionary search. By comparing with the Mixed-Variable Ant Colony Optimization (ACO _MV) algorithm and the Success History-based Adaptive Differential Evolution algorithm with linear population size reduction and Ant Colony Optimization (L-SHADE _ACO), it is demonstrated that CACOA _MV is able to perform better local exploitation, so as to improve approximation quality of the final results in the target space; the comparison with the set-based Differential Evolution algorithm with Mixed-Variables (DE _MV) shows that CACOA _MV is able to better approximate the global optimal solutions in the decision space and has better global exploration ability. In conclusion, CACOA _MV with the coevolutionary strategy can keep a balance between global exploration and local exploitation, which results in better optimization ability.

Aiming at the problems of large number of model parameters, large computational cost and low accuracy when using deep learning algorithms for pointer instrument recognition task, an intelligent detection and recognition system of circular pointer instrument based on the combination of improved pre-trained MobileNetV2 network model and circular Hough transform was proposed. Firstly, the Hough transform was used to solve the interference problem of non-circular areas in complex scene. Then, the circular areas were extracted to construct datasets. Finally, the circular pointer instrument recognition was realized by using the improved pre-trained MobileNetV2 network model. The average confusion matrix was used to measure the performance of the proposed model. Experimental results show that, the recognition rate of the proposed system in the recognition task of circular pointer instruments reaches 99.76%. At the same time, the results of comparing the proposed model with other five different network models show that the proposed model and ResNet50 both have the highest accuracy, but compared with ResNet50, the proposed network model has the model parameter number and model computational cost reduced by 90.51% and 92.40% respectively, verifying that the proposed model is helpful for the further deployment and implementation of industrial grade real-time circular pointer instrument detection and recognition in mobile terminals or embedded devices.

Considering the data sharing difficulties and the risk of privacy disclosure in grid cloud server based on blockchain, a Data Sharing model based on Double Consortium Blockchains in smart grid(DSDCB) was proposed. Firstly, the data of electricity was stored under-chain by Inter Planetary File System(IPFS), the IPFS file fingerprints were stored on-chain, and the electricity data was shared to other consortium blockchain based on the multi-signature notary technology. Secondly, with ensuring privacy from leakage, proxy re-encryption and secure multi-party computing were combined to share single-node or multi-node security data. Finally, fully homomorphic encryption algorithm was used to integrate ciphertext data reasonably without decrypting the electricity data. The 51% attack, sybil attack, replay attack and man-in-the-middle attacks were resisted by the single-node cross-chain data sharing model of DSDCB. It was verified that the security and privacy of data were guaranteed by the secure multi-party cross-chain data sharing model of DSDCB when the number of malicious participants was less than k and the number of honest participants was more than 1. The simulation comparison shows that the computational cost of the DSDCB model is lower than those of Proxy Broadcast Re-Encryption(PBRE) and Data Sharing scheme based on Conditional PBRE(CPBRE-DS), and the model is more feasible than the Fully Homomorphic Non-interactive Verifiable Secret Sharing(FHNVSS) scheme.

When the Log-Structured Merge-tree (LSM-tree) in the time series database is under high write load or resource constraints, file compaction not in time will cause a large accumulation of LSM C ₀ layer data, resulting in an increase in the latency of ad hoc queries of recently written data. To address this problem, a two-stage LSM compaction framework was proposed that realizes low-latency query of newly written time series data on the basis of maintaining efficient query for large blocks of data. Firstly, the file compaction process was divided into two stages:quickly merging of a small number of out-of-order files, merging of a large number of small files, then multiple file compaction strategies were provided in each stage, finally the two-stage compaction resource allocation was performed according to the query load of the system. By implementing the test of the traditional LSM compaction strategy and the two-stage LSM compaction framework on the time series database Apache IoTDB, the results showed that compared with the traditional LSM, the two-stage file compaction module was able to greatly reduce the number of ad hoc query reads while improving the flexibility of the strategy, and made the historical data analysis and query performance improved by about 20%. Experimental results show that the two-stage LSM compaction framework can increase the ad hoc query efficiency of recently written data, and can improve the performance of historical data analysis and query as well as the flexibility of compaction strategy.

Concerning the safety and monitoring problems of the blind people during traveling, the design of a networked cane system for blind people based on machine learning algorithms was proposed. Multiple functions were added to the system, such as obstacle avoidance, positioning, alarm and communication. First, infrared obstacle avoidance and ultrasonic ranging obstacle avoidance were designed as the basic functions of the system, which could be used to detect road conditions and obstacles for the daily travel of the blind and provide real-time voice and motor vibration reminders. Second, remote communication function for help was added to the system, which was able to send help text messages and phone calls to specific mobile numbers. In addition, Global Positioning System (GPS) function, accelerometer gyroscope attitude angle calculation function and abnormal attitude alarm function based on K-Nearest Neighbor (KNN) and Dynamic Time Warping (DTW) algorithms were also added, which were able to transfer all kinds of information data to the cloud server storage. Finally, the WeChat mini program was used to replace the native APP as the monitoring operation interface, and functions such as one-click alarm, weather query, blind safety information were provided. Test results show that the proposed system has the attitude recognition success rate reached 86%, and has the accuracy improved by nearly 31% compared to the attitude angle system. The networked cane system for blind people can greatly improve the security of the blind during traveling, so that the blind can ask for help in time when an accident occurs, and achieve the safe monitoring and positioning monitoring of the blind postures.

The MAVLink is a lightweight communication protocol between Unmanned Aerial Vehicle (UAV) and Ground Control Station (GCS). It defines a set of mutual bi-directional messages between UAV and GCS, including UAV states and GCS control commands. However, the MAVLink protocol lacks sufficient security mechanisms, and there are security vulnerabilities that may cause serious threats and hidden dangers. To resolve these problems, a security communication scheme for the UAV system based on the MAVLink protocol was proposed. First, the connection requests were broadcasted by the UAV constantly and alternately; then the public key was sent to the UAV by the GSC, and the DH algorithm was used by both sides to negotiate a shared key, and the AES algorithm was used to encrypt the communication on MAVLink message packages, achieving identity authentication. If the UAV did not receive the public key sent by the GCS within the specified time or a decryption error on MAVLink message package happened, the UAV would actively disconnect and update a new public key to rebroadcast the connection request. In addition, concerning the security problem of the UAV system being maliciously tampered with, the system firmware was self-checked during booting. Finally, based on the formal verification platform UPPAAL, it has been proved that the proposed scheme has the security properties of liveness, connectability and connection uniqueness. Results of the communication process between UAV PX4 1.6.0 and GCS QgroundControl 3.5.0 show that the proposed secure communication scheme of UAV system can prevent malicious eavesdropping, message tampering, man in the middle attack and other malicious attacks in the communication process between UAV and GCS, and solve the security vulnerabilities of MAVLink protocol well with little effect on UAV performance.

Aiming at the problem of neglecting some narrow roads due to the formation constraints in the multi-UAV （Unmanned Aerial Vehicle） cooperative trajectory planning, a Fast Particle Swarm Optimization method based on Adaptive Distributed Model Predictive Control (ADMPC-FPSO) was proposed. In the method, the formation strategy combining leader-follower method and virtual structure method was used to construct adaptive virtual formation guidance points to complete the cooperative formation control task. According to the idea of model predictive control, combined with the distributed control method, the cooperative trajectory planning was transformed into a rolling online optimization problem, and the minimum distance and other performance indicators were used as cost functions. By designing the evaluation function criterion, the variable weight fast particle swarm optimization algorithm was used to solve the problem. The simulation results show that the proposed algorithm can effectively realize the multi-UAV cooperative trajectory planning, can quickly complete the adaptive formation transformation according to the environmental changes, and has lower cost than the traditional formation strategy.

Although the existing image inpainting methods can recover the content of the missing area of the image, there are still some problems, such as structure distortion, texture blurring and content discontinuity, so that the inpainted images cannot meet people’s visual requirements. To solve these problems, an image inpainting method based on dilated convolution was proposed. By introducing the idea of dilated convolution to increase the receptive field, the quality of image inpainting was improved. This method was based on the idea of Generative Adversarial Network (GAN), which was divided into generative network and adversarial network. The generative network included global content inpainting network and local detail inpainting network, and gated convolution was used to realize the dynamical learning of the image features, solving the problem that the traditional convolution neural network method was not able to complete the large irregular missing areas well. Firstly, the global content inpainting network was used to obtain an initial content completion result, and then the local texture details were repaired by the local detail inpainting network. The adversarial network was composed of SN-PatchGAN discriminator, and was used to evaluate the image inpainting effect. Experimental results show that compared with the current image inpainting methods, the proposed method has great improvement in Peak Signal-to-Noise Ratio (PSNR), Structural SIMilarity (SSIM) and inception score. Moreover, the method effectively solves the problem of texture blurring in traditional inpainting methods, and meets people’s visual requirements better, verifying the validity and feasibility of the proposed method.

When the areas to be inpainted in the face image are large, there are some visual defects caused by the inpainting of the existing methods, such as unreasonable image semantic understanding and incoherent boundary. To solve this problem, an end-to-end image inpainting model of U-Net structure based on dense blocks was proposed to achieve the inpainting of semantic face of any mask. Firstly, the idea of generative adversarial network was adopted. In the generator, the convolutional layers in U-Net were replaced with dense blocks to capture the semantic information of the missing regions of the image and to make sure the features of the previous layers were reused. Then, the skip connections were adopted to reduce the information loss caused by the down-sampling, so as to extract the semantics of the missing regions. Finally, by introducing the joint loss function combining adversarial loss, content loss and local Total Variation (TV) loss to train the generator, the visual consistency between the inpainted boundary and the surrounding real image was ensured, and Hinge loss was used to train the discriminator. The proposed model was compared with Globally and Locally Consistent image completion(GLC),Deep Fusion(DF) and Gated Convolution(GC) on CelebA-HQ face dataset. Experimental results show that the proposed model can effectively extract the semantic information of face images, and its inpainting results have the boundaries with natural transition and clear local details. Compared with the second-best GC, the proposed model has the Structure SIMilarity index (SSIM) and Peak Signal-to-Noise Ratio (PSNR) increased by 5.68% and 7.87% respectively, while the Frechet Inception Distance (FID) decreased by 7.86% for the central masks; and has the SSIM and PSNR increased by 7.06% and 4.80% respectively while the FID decreased by 6.85% for the random masks.

Aiming at the shortage of traditional matrix completion algorithm in image reconstruction, a completion algorithm based on NonLocal self-similarity and Low Rank Matrix Approximation (NL-LRMA) was proposed. Firstly, the nonlocal similar patches corresponding to the local patches in the image were found through similarity measurement, and the corresponding grayscale matrices were vectorized to construct the nonlocal similar patch matrix. Secondly, aiming at the low-rank property of the obtained similarity matrix, Low-Rank Matrix Approximation (LRMA) was carried out. Finally, the completion results were recombined to achieve the goal of restoring the original image. Reconstruction experiments were performed on grayscale and RGB images. The results show that the average Peak Signal-to-Noise Ratio (PSNR) of NL-LRMA algorithm is 4 dB to 7 dB higher than that of the original LRMA algorithm on a classic dataset; at the same time, NL-LRMA algorithm is better than IRNN (Iteratively Reweighted Nuclear Norm), WNNM (Weighted Nuclear Norm Minimization), LRMA (Low-Rank Matrix Approximation) and other traditional algorithms in the terms of visual effect and PSNR value. In short, NL-LRMA algorithm effectively make up for the shortcomings of traditional algorithms in natural image reconstruction, so as to provide an effective solution for image reconstruction.

The teaching of Chinese architecture history has building structures too complex, is limited to 2D planar teaching and is not easy for students to master and apply, therefore an implementation method of Chinese architecture history teaching system based on mixed reality technology was proposed. The wooden structure system of Baoguo Temple in Ningbo was taken as an example, and the mixed reality device Microsoft HoloLens was used as the teaching platform. Firstly, 3ds Max was applied to the 3D simulation modeling of the wooden structure system of Baoguo Temple based on the collected data, and a building model library was built. Then, the 3D human-computer interface of the virtual teaching system was constructed in unity3D, the key technologies were used including environment understanding and human-computer interaction based on C# scripts, and a Chinese architectural history teaching system using HoloLens was implemented with core functions of building structure recognition and cultural cognition. The results show that the system has good 3D visual effects and natural effective human-computer interaction, which can improve the efficiency of knowledge transfer and the initiative of students.

To solve the problem of low recognition rate of motor imagery ElectroEncephaloGram (EEG) signals, considering that EEG signals contain abundant time-frequency information, a recognition method based on Convolutional Neural Network (CNN) in time-frequency domain was proposed. Firstly, Short-Time Fourier Transform (STFT) was applied to preprocess the relevant frequency bands of EEG signals to construct a two-dimensional time-frequency domain map composed of multiple time-frequency maps of electrodes, which was regarded as the input of the CNN. Secondly, focusing on the time-frequency characteristic of two-dimensional time-frequency domain map, a novel CNN structure was designed by one-dimensional convolution method. Finally, the features extracted by CNN were classified by Support Vector Machine (SVM). Experimental results based on BCI dataset show that the average recognition rate of the proposed method is 86.5%, which is higher than that of traditional motor imagery EEG signal recognition method, and the proposed method has been applied to the intelligent wheelchair, which proves its effectiveness.

Griffin-Lim algorithm is widely used in end-to-end speech synthesis with phase estimation, which always produces obviously artificial speech with low fidelity. Aiming at this problem, a system for end-to-end speech synthesis based on WaveNet network architecture was proposed. Based on Seq2Seq (Sequence-to-Sequence) structure, firstly the input text was converted into a one-hot vector, then, the attention mechanism was introduced to obtain a Mel spectrogram, finally WaveNet network was used to reconstruct phase information to generate time-domain waveform samples from the Mel spectrogram features. Aiming at English and Chinese, the proposed method achieves a Mean Opinion Score (MOS) of 3.31 on LJSpeech-1.0 corpus and 3.02 on THchs-30 corpus, which outperforms the end-to-end systems based on Griffin-Lim algorithm and parametric systems in terms of naturalness.

In order to solve the problem that the traditional cascaded Convolutional Neural Network (CNN) has low accuracy of feature point localization in left ventricular ultrasound image, an improved cascaded CNN with region extracted by Faster Region-based CNN (Faster-RCNN) model was proposed to locate the left ventricular endocardial and epicardial feature points in ultrasound images. Firstly, the traditional cascaded CNN was improved by a structure of two-stage cascaded. In the first stage, an improved convolutional network was used to roughly locate the endocardial and epicardial joint feature points. In the second stage, four improved convolutional networks were used to fine-tune the endocardial feature points and the epicardial feature points separately. After that, the positions of joint contour feature points were output. Secondly, the improved cascaded CNN was merged with target region extraction, which means that the target region containing the left ventricle was extracted by the Faster-RCNN model and then was sent into the improved cascaded CNN. Finally, the left ventricular contour feature points were located from coarse to fine. Experimental results show that compared with the traditional cascaded CNN, the proposed method is much more accurate in left ventricle feature point localization, and its prediction points are closer to the actual values. Under the root mean square error evaluation standard, the accuracy of feature point localization is improved by 32.6 percentage points.

To deal with poor robustness in strong noise environment, weak adaptability to complex mixed noise that appear in the existing unsupervised image segmentation models, an improved noise-robust image segmentation model based on One-class SVM (Support Vector Machine) method was proposed. Firstly, a data outlier detection mechanism was constructed based on One-class SVM. Secondly, an outlier degree was introduced into the energy function, so that more accurate image information could be obtained by the proposed model under multiple noise intensities and the failure of weight-descend mechanism in strong noise environment was avoided. Finally, the segmentation contour was driven to the target edge by minimizing the energy function. In noise image segmentation experiments, the proposed model could obtain ideal segmentation results with different types and intensities of noise. Under F₁-score metric, the proposed model is 0.2 to 0.3 higher than LCK (Local Correntropy-based K-means) model, and has better stability in strong noise environments. The segmentation convergence time of the proposed model is only slightly longer than that of LCK model by about 0.1 s. Experimental results show that the proposed model is more robust to probabilistic, extreme values and mixed noise without significantly increase of segmentation time, and can segment natural images with noise.

By the combination of fuzzy particle swarm optimization algorithm based on receding horizon control and improved artificial potential field, an on-line path planning method for achieving fixed-wing Unmanned Aerial Vehicle (UAV) path planning in uncertain environment was proposed. Firstly, the minimum circumscribed circle fitting was performed on the convex polygonal obstacles. Then, aiming at the static obstacles, the path planning problem was transformed into a series of on-line sub-problems in the time domain window, and the fuzzy particle swarm algorithm was applied to optimize and solve the sub-problems in real time, realizing the static obstacle avoidance. When there were dynamic obstacles in the environment, the improved artificial potential field was used to accomplish the dynamic obstacle avoidance by adjusting the path. In order to meet the dynamic constraints of fixed-wing UAV, a collision detection method for fixed-wing UAV was proposed to judge whether the obstacles were real threat sources or not in advance and reduce the flight cost by decreasing the turning frequency and range. The simulation results show that, the proposed method can effectively improve the planning speed, stability and real-time obstacle avoidance ability of fixed-wing UAV path planning, and it overcomes the shortcoming of easy to falling into local optimum in traditional artificial potential field method.

To improve the bad performance of crowd counting in surveillance videos and images caused by the scale and perspective variation, a crowd counting model, named Multi-scale Multi-column Convolutional Neural Network (MsMCNN) was proposed. Before extracting features with MsMCNN, the dataset was processed with the Gaussian filter to obtain the true density maps of images, and the data augmentation was performed. With the structure of multi-column convolutional neural network as the backbone, MsMCNN firstly extracted feature maps from multiple columns with multiple scales. Then, MsMCNN was used to generate the estimated density map by combining feature maps with the same resolution in the same column. Finally, crowd counting was realized by integrating the estimated density map. To verify the effectiveness of the proposed model, experiments were conducted on Shanghaitech and UCF_CC_50 datasets. Compared to the classic methods:Crowdnet, Multi-column Convolutional Neural Network (MCNN), Cascaded Multi-Task Learning (CMTL) and Scale-adaptive Convolutional Neural Network (SaCNN), the Mean Absolute Error (MAE) of MsMCNN respectively decreases 10.6 and 24.5 at least on Part_A and UCF_CC_50 of Shanghaitech dataset, and the Mean Squared Error (MSE) of MsMCNN respectively decreases 1.8 and 29.3 at least. Furthermore, MsMCNN also achieves the better result on the Part_B of the Shanghaitech dataset. MsMCNN pays more attention to the combination of shallow features and the combination of multi-scale features in the feature extraction process, which can effectively reduce the impact of low accuracy caused by scale and perspective variation, and improve the performance of crowd counting.

In order to effectively protect video information, according to the characteristics of H.265/HEVC (High Efficiency Video Coding), a scheme combining transform coefficient scrambling and syntax element encryption was proposed. For Transform Unit (TU), the TU with the size of 4×4 was scrambled by Arnold transform. At the same time, a shift cipher was designed, and the cipher was initialized according to the approximate distribution rule of the Direct Current (DC) coefficient of the TU, and the DC coefficients of TU with the size of 8×8, 16×16 and 32×32 were shifting encrypted using encryption map generated by Arnold transform. For some of the syntax elements with bypass coding used in the entropy coding process, the Logistic chaotic sequence was used for encryption. After encryption, the Peak Signal-to-Noise Ratio (PSNR) and Structual Similarity (SSIM) of the video were decreased by 26.1 dB and 0.51 respectively on average, while the compression ratio was only decreased by 1.126% and the coding time was only increased by 0.17%. Experimental results show that under the premise of ensuring better encryption effect and less impact on bit rate, the proposed scheme has less extra coding overhead and is suitable for real-time video applications.

To solve the problem of insufficient sample resources and poor noise immunity for single image Super Resolution (SR) restoration, a single image super-resolution algorithm based on structural self-similarity and deformation block feature was proposed. Firstly, a scale model was constructed to expand search space as much as possible and overcome the shortcomings of lack of a single image super-resolution training sample. Secondly, the limited internal dictionary size was increased by geometric deformation of sample block. Finally, in order to improve anti-noise performance of reconstructed picture, the group sparse learning dictionary was used to reconstruct image. The experimental results show that compared with the excellent algorithms such as Bicubic, Sparse coding Super Resolution (ScSR) algorithm and Super-Resolution Convolutional Neural Network (SRCNN) algorithm, the super-resolution images with more subjective visual effects and higher objective evaluation can be obtained, the Peak Signal-To-Noise Ratio (PSNR) of the proposed algorithm is increased by about 0.35 dB on average. In addition, the scale of dictionary is expanded and the accuracy of search is increased by means of geometric deformation, and the time consumption of algorithm is averagely reduced by about 80 s.

Exemplar-based image inpainting methods may cause local mosaic effects and visual incoherence, since the interference of image tiny texture and noise often result in invalid priority terms that makes the inpainting order abnormal. Besides, when searching for the best matching patch, the inter structure information of patches are ignored, which leads to non-unique best matching patches. To tackle these aforementioned issues, a new image inpainting model based on structure-texture decomposition and local total variation minimization was proposed. Three improvements were presented and detailed. Firstly, for an given image to be inpainted, the structure image was extracted by using the logarithm total variation minimization model, then the inpainting priority was calculated on this auxiliary image. In this way, a more robust filling mechanism can be achieved, since the isophote direction of the structure image is less noisy than the original image. Secondly, the priority term was redefined as the weighted summation of data term and confidence term to eliminate the product effect and ensure that the data term was always effective. As a result, the image mismatching rate caused by unreasonable inpainting order was reduced. Finally, the problem of choosing the best matching patch was converted into a 0-1 optimization problem aiming to reach a minimal local total variation. Comprehensive comparisons with the state-of-the-art three inpainting methods show that the Peak Signal-to-Noise Ratio (PSNR) of the proposed algorithm is improved by 1.12-3.56 dB, and the Structural Similarity Index Measure (SSIM) is improved by 0.02-0.04. The proposed model can ensure a better selection of pixel candidates to fill in, and achieve a better global coherence of the reconstruction; therefore, the results are more visually appealing and with less block artifacts for inpainting large damaged images.

The deep learning model increases the number of hidden layers, which makes the model have a good effect on speech recognition, image video classification and so on. However, to establish a model suitable for a specific object, a large number of data sets are required to train it for a long time to get the appropriate weights and biases. To resolve the above problems, a sub-health diagnosis method for rolling bearing was proposed based on depth autoencoder-relevance vector machine network model. Firstly, the bearing vibration signal was collected and transformed by Fourier transform and normalization. Secondly, the improved automatic encoder, named sparse edge noise reduction autoencoder, was designed, which combined the features of sparse automatic encoder and edge noise reduction automatic encoder. Then the depth autoencoder-relevance vector machine network model was designed, in which the supervised function was used to finely tune the parameters of each hidden layer, and it was trained by Relevance Vector Machine (RVM). Finally, the final classification results were obtained according to D-S (Dempster-Shafer) evidence fusion theory. The experimental results show that the proposed algorithm can effectively improve the recognition precision of the "sub-health" state of the rolling bearing and correct the error classification.

Aiming at long-term software maintenance even introduction of errors due to extensive use of cloned code, a classifier based on decision tree was proposed to recommend clone for refactoring. Firstly, clone detection was performed using NiCad. Secondly, the features related to cloning relationship, cloned code segment and clonal context were collected. Thirdly, a decision tree classifier was used for training. Finally, the classification results were evaluated by K-fold crossover. The experiments were conducted on nearly 600 clones in five kinds of open-source software. The experimental results show that the proposed method achieves 80% accuracy when recommending clonal refactoring instances for each target system.

Aiming at the problem that IPv6 nodes are easily under probing attack by an attacker while end-to-end communication is restored in the IPv6 network, a proactive defense model of Address Hopping based on Sliding Time Window in IPv6 (AHSTW) was proposed. Session parameters such as the address hopping interval were firstly negotiated by using the shared key, and then the concept of sending and receiving time window was introduced. The two communication parties sent or received only the packets in the time window, through a Time Window Adaptive Adjustment (TWAA) algorithm. According to the change of network delay, the time window could be adjusted in time to adapt to the changes of the network environment. The theoretical analysis shows that the proposed model can effectively resist the data interception attacks and Denial of Service (DoS) attacks on the target IPv6 nodes. The experimental results show that in the transmission of the same data packet size, the extra CPU overhead of AHSTW model is to 2-5 percentage points, with no significant increase in communication cost and no significant decline in communication efficiency. The addresses and ports of two communication parties are random, decentralized, out of order and so on, which greatly improves the cost and difficulty of attackers and protects the network security of IPv6.

Total variation minimization based image impainting method is easy to cause staircase effect in smooth regions. In order to solve the problem, a novel non-local total variation image inpainting model based on logarithmic function was proposed. The integrand function of the new total variation energy function is a logarithmic function concerning the magnitude of gradient. Under the framework of partial differential equations of total variation model and anisotropic diffusion model, firstly, the proposed model was proven theoretically to satisfy all the properties required for good diffusion. Besides, the local diffusion behavior was theoretically analyzed, and its good properties of diffusion in equal illumination direction and gradient direction were proved. Then, in order to consider the similarity of image blocks and avoid local blur, non-local logarithmic total variation was used for numerical implementation. The experimental results demonstrate that, compared with a classical total variation image inpainting model, the proposed non-local total variation image inpainting model based on logarithmic function has good effect on image inpainting, avoids local blur, and can better suppress the staircase effect in image smooth region; in the meantime, compared with the exemplar-based inpainting model, the proposed model can obtain more natural inpainting effect for texture images. The experimental results show that, compared with three types of total variation models and the exemplar-based inpainting model, the proposed model has the best performance. Compared with the average results of the comparison models (figure 2, figure 3, figure 4), the Structural Similarity Index Measure (SSIM) of the proposed model is improved by 0.065, 0.022 and 0.051, while its Peak Signal-to-Noise Ratio (PSNR) is improved by 5.94 dB、4.00 dB and 6.22 dB. The inpainting results of noisy images show that the proposed model has good robustness and can also get good inpainting results for noisy images.

Hbase can only use key value query, it is not suitable for multidimensional query of mobile objects in road network, which leads to inefficiency in storing index and query. In order to solve this problem, an efficient HBase indexing framework for Road network Moving objects (RM-HBase) was designed and implemented on the basis of HBase storage structure. Firstly, the upper Hmaster and lower HregionServer of the primary HBase index structure were improved to solve the hot distribution problem of distributed cluster data and improve the query efficiency of spatial data. Secondly, the road network moving object index - Road Network tree (RN-tree) was proposed to solve the problem of "dead space" in space division and improve the query efficiency of road sections in the space at the same time. Then, based on the above improvements of HBase index, the query algorithms for spatio-temporal range query, spatial-temporal K Nearest Neighbor (KNN) query and moving object trajectory query were designed respectively. Finally, the Spatial-TEmporal HBase IndeX (STEHIX) framework based on HBase distributed database was selected as the contrast object, the performance of RM-HBase was respectively analyzed from two aspects of the performance of index framework and the efficiency of query algorithm. The experimental results show that, the proposed RM-HBase is superior to the STEHIX framework in both the performance of data equilibrium distribution and the query performance of spatio-temporal query algorithm, and it is helpful to promote the efficiency of spatial-temporal index for the moving object data in mass road network.

Concerning the problem that distant historical signals cannot be transmitted to the current time under the network structure of Recurrent Neural Network (RNN), Long Short Term Memory (LSTM) network was proposed as a variant of RNN. On the premise of inheriting RNN's excellent memory ability for time series, LSTM overcomes the long-term dependence problem of time series and has a remarkable performance in natural language processing and speech recognition. For the long-term dependence problem of human behavior data as a time series and the problem of not real-time detection caused by using the traditional sliding window algorithm to collect data, the LSTM was extended and applied to the human posture detection, and then a human posture detection method based on LSTM was proposed. By using the real-time data collected by the accelerometers, gyroscopes, barometers and direction sensors in the smartphones, a human posture dataset with a total of 3336 manual annotation data was produced. The five kinds of daily behavior postures such as walking, running, going upstairs, going downstairs, calmness as well as the four kinds of sudden behavior postures of fallling, standing, sitting, jumping, were predicted and classified. The LSTM network was compared with the commonly used methods such as shallow learning algorithm, deep learning fully connected neural network and convolution neural network. The experimental results show that, by using the end-to-end deep learning method, the proposed method has improved the accuracy by 4.49 percentage points compared to the model of human posture detection algorithm trained on the produced dataset. The generalization ability of the proposed network structure is verified and it is more suitable for posture detection.